Preparation contextuality powers parity-oblivious multiplexing.

نویسندگان

  • Robert W Spekkens
  • D H Buzacott
  • A J Keehn
  • Ben Toner
  • G J Pryde
چکیده

In a noncontextual hidden variable model of quantum theory, hidden variables determine the outcomes of every measurement in a manner that is independent of how the measurement is implemented. Using a generalization of this notion to arbitrary operational theories and to preparation procedures, we demonstrate that a particular two-party information-processing task, "parity-oblivious multiplexing," is powered by contextuality in the sense that there is a limit to how well any theory described by a noncontextual hidden variable model can perform. This bound constitutes a "noncontextuality inequality" that is violated by quantum theory. We report an experimental violation of this inequality in good agreement with the quantum predictions. The experimental results also provide the first demonstration of 2-to-1 and 3-to-1 quantum random access codes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parity Oblivious d-Level Random Access Codes and Class of Noncontextuality Inequalities

One of the fundamental results in quantum foundations is the Kochen-Specker no-go theorem. For the quantum theory, the no-go theorem excludes the possibility of a class of hidden variable models where value attribution is context independent. Recently, the notion of contextuality has been generalized for different operational procedures and it has been shown that preparation contextuality of mi...

متن کامل

Optimal Bounds for Parity-Oblivious Random Access Codes with Applications

Random Access Codes is an information task that has been extensively studied and found many applications in quantum information. In this scenario, Alice receives an n-bit string x, and wishes to encode x into a quantum state ρx, such that Bob, when receiving the state ρx, can choose any bit i ∈ [n] and recover the input bit xi with high probability. Here we study a variant called parity-oblivio...

متن کامل

Linear Codes are Hard for Oblivious Read-Once Parity Branching Programs

We show that the characteristic functions of linear codes are exponentially hard for the model of oblivious read-once branching programs with parity accepting mode, known also as Parity OBDDs. The proof is extremely simple, and employs a particular combinatorial property of linear codes { their universality.

متن کامل

Accepted to ECML-94 Bottom-Up Induction of Oblivious Read-Once Decision Graphs

We investigate the use of oblivious, read-once decision graphs as structures for representing concepts over discrete domains, and present a bottom-up, hill-climbing algorithm for inferring these structures from labelled instances. The algorithm is robust with respect to irrelevant attributes, and experimental results show that it performs well on problems considered di cult for symbolic inducti...

متن کامل

Bottom-Up Induction of Oblivious Read-Once Decision Graphs

We investigate the use of oblivious, read-once decision graphs as structures for representing concepts over discrete domains, and present a bottom-up, hill-climbing algorithm for inferring these structures from labelled instances. The algorithm is robust with respect to irrelevant attributes , and experimental results show that it performs well on problems considered diicult for symbolic induct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Physical review letters

دوره 102 1  شماره 

صفحات  -

تاریخ انتشار 2009